TSTP Solution File: ITP117^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP117^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 22:16:23 EDT 2024
% Result : Theorem 0.46s 0.56s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 16
% Syntax : Number of formulae : 24 ( 11 unt; 13 typ; 0 def)
% Number of atoms : 11 ( 10 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 83 ( 4 ~; 0 |; 0 &; 79 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Number of types : 5 ( 5 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 8 ( 2 ^ 6 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
extend1728876344nnreal: $tType ).
thf(decl_sort2,type,
set_Fi1058188332real_n: $tType ).
thf(decl_sort3,type,
sigma_1466784463real_n: $tType ).
thf(decl_sort4,type,
nat: $tType ).
thf(decl_sort5,type,
finite964658038_int_n: $tType ).
thf(decl_31,type,
comple230862828real_n: sigma_1466784463real_n > sigma_1466784463real_n ).
thf(decl_48,type,
lebesg260170249real_n: sigma_1466784463real_n ).
thf(decl_118,type,
sigma_1536574303real_n: sigma_1466784463real_n > set_Fi1058188332real_n > extend1728876344nnreal ).
thf(decl_134,type,
t: finite964658038_int_n > set_Fi1058188332real_n ).
thf(decl_135,type,
t2: finite964658038_int_n > set_Fi1058188332real_n ).
thf(decl_136,type,
f: nat > finite964658038_int_n ).
thf(decl_137,type,
esk1_0: nat ).
thf(decl_142,type,
esk6_0: nat > set_Fi1058188332real_n ).
thf(conj_0,conjecture,
( ( ^ [X2: nat] : ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t2 @ ( f @ X2 ) ) ) )
= ( ^ [X2: nat] : ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t @ ( f @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
thf(fact_0_emeasure__T_H,axiom,
! [X1: finite964658038_int_n] :
( ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t @ X1 ) )
= ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t2 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_emeasure__T_H) ).
thf(c_0_2,negated_conjecture,
~ ! [X964: nat] :
( ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t2 @ ( f @ X964 ) ) )
= ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t @ ( f @ X964 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])]) ).
thf(c_0_3,negated_conjecture,
( ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t2 @ ( f @ esk1_0 ) ) )
!= ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t @ ( f @ esk1_0 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
thf(c_0_4,plain,
! [X1122: nat] :
( ( esk6_0 @ X1122 )
= ( t2 @ ( f @ X1122 ) ) ),
inference(variable_rename,[status(thm)],]) ).
thf(c_0_5,negated_conjecture,
( ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t2 @ ( f @ esk1_0 ) ) )
!= ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t @ ( f @ esk1_0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,plain,
! [X2: nat] :
( ( esk6_0 @ X2 )
= ( t2 @ ( f @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,plain,
! [X971: finite964658038_int_n] :
( ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t @ X971 ) )
= ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t2 @ X971 ) ) ),
inference(variable_rename,[status(thm)],[fact_0_emeasure__T_H]) ).
thf(c_0_8,negated_conjecture,
( ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t @ ( f @ esk1_0 ) ) )
!= ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( esk6_0 @ esk1_0 ) ) ),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,plain,
! [X1: finite964658038_int_n] :
( ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t @ X1 ) )
= ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t2 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : ITP117^1 : TPTP v8.2.0. Released v7.5.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.37 % Computer : n015.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8042.1875MB
% 0.13/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Sat May 18 18:06:08 EDT 2024
% 0.13/0.37 % CPUTime :
% 0.22/0.51 Running higher-order theorem proving
% 0.22/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.46/0.56 # Version: 3.1.0-ho
% 0.46/0.56 # Preprocessing class: HSLMSMSMSSLNHSA.
% 0.46/0.56 # Scheduled 7 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.56 # Starting new_bool_8 with 600s (2) cores
% 0.46/0.56 # Starting new_ho_3 with 300s (1) cores
% 0.46/0.56 # Starting additional_ho_3 with 300s (1) cores
% 0.46/0.56 # Starting full_lambda_10 with 300s (1) cores
% 0.46/0.56 # Starting ehoh_best with 300s (1) cores
% 0.46/0.56 # Starting sh2lt with 300s (1) cores
% 0.46/0.56 # Starting full_lambda_4 with 300s (1) cores
% 0.46/0.56 # new_bool_8 with pid 12557 completed with status 0
% 0.46/0.56 # Result found by new_bool_8
% 0.46/0.56 # Preprocessing class: HSLMSMSMSSLNHSA.
% 0.46/0.56 # Scheduled 7 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.56 # Starting new_bool_8 with 600s (2) cores
% 0.46/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.46/0.56 # Search class: HGUSM-FFMF21-MHSFFSNN
% 0.46/0.56 # partial match(4): FGUSM-FFMF21-MFFFFFNN
% 0.46/0.56 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.46/0.56 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 325s (1) cores
% 0.46/0.56 # Starting new_bool_8 with 61s (1) cores
% 0.46/0.56 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 12564 completed with status 0
% 0.46/0.56 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 0.46/0.56 # Preprocessing class: HSLMSMSMSSLNHSA.
% 0.46/0.56 # Scheduled 7 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.56 # Starting new_bool_8 with 600s (2) cores
% 0.46/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.46/0.56 # Search class: HGUSM-FFMF21-MHSFFSNN
% 0.46/0.56 # partial match(4): FGUSM-FFMF21-MFFFFFNN
% 0.46/0.56 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.46/0.56 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 325s (1) cores
% 0.46/0.56 # Preprocessing time : 0.006 s
% 0.46/0.56
% 0.46/0.56 # Proof found!
% 0.46/0.56 # SZS status Theorem
% 0.46/0.56 # SZS output start CNFRefutation
% See solution above
% 0.46/0.56 # Parsed axioms : 487
% 0.46/0.56 # Removed by relevancy pruning/SinE : 446
% 0.46/0.56 # Initial clauses : 56
% 0.46/0.56 # Removed in clause preprocessing : 0
% 0.46/0.56 # Initial clauses in saturation : 56
% 0.46/0.56 # Processed clauses : 3
% 0.46/0.56 # ...of these trivial : 0
% 0.46/0.56 # ...subsumed : 0
% 0.46/0.56 # ...remaining for further processing : 3
% 0.46/0.56 # Other redundant clauses eliminated : 0
% 0.46/0.56 # Clauses deleted for lack of memory : 0
% 0.46/0.56 # Backward-subsumed : 0
% 0.46/0.56 # Backward-rewritten : 1
% 0.46/0.56 # Generated clauses : 0
% 0.46/0.56 # ...of the previous two non-redundant : 0
% 0.46/0.56 # ...aggressively subsumed : 0
% 0.46/0.56 # Contextual simplify-reflections : 0
% 0.46/0.56 # Paramodulations : 0
% 0.46/0.56 # Factorizations : 0
% 0.46/0.56 # NegExts : 0
% 0.46/0.56 # Equation resolutions : 0
% 0.46/0.56 # Disequality decompositions : 0
% 0.46/0.56 # Total rewrite steps : 3
% 0.46/0.56 # ...of those cached : 1
% 0.46/0.56 # Propositional unsat checks : 0
% 0.46/0.56 # Propositional check models : 0
% 0.46/0.56 # Propositional check unsatisfiable : 0
% 0.46/0.56 # Propositional clauses : 0
% 0.46/0.56 # Propositional clauses after purity: 0
% 0.46/0.56 # Propositional unsat core size : 0
% 0.46/0.56 # Propositional preprocessing time : 0.000
% 0.46/0.56 # Propositional encoding time : 0.000
% 0.46/0.56 # Propositional solver time : 0.000
% 0.46/0.56 # Success case prop preproc time : 0.000
% 0.46/0.56 # Success case prop encoding time : 0.000
% 0.46/0.56 # Success case prop solver time : 0.000
% 0.46/0.56 # Current number of processed clauses : 2
% 0.46/0.56 # Positive orientable unit clauses : 2
% 0.46/0.56 # Positive unorientable unit clauses: 0
% 0.46/0.56 # Negative unit clauses : 0
% 0.46/0.56 # Non-unit-clauses : 0
% 0.46/0.56 # Current number of unprocessed clauses: 53
% 0.46/0.56 # ...number of literals in the above : 79
% 0.46/0.56 # Current number of archived formulas : 0
% 0.46/0.56 # Current number of archived clauses : 1
% 0.46/0.56 # Clause-clause subsumption calls (NU) : 0
% 0.46/0.56 # Rec. Clause-clause subsumption calls : 0
% 0.46/0.56 # Non-unit clause-clause subsumptions : 0
% 0.46/0.56 # Unit Clause-clause subsumption calls : 0
% 0.46/0.56 # Rewrite failures with RHS unbound : 0
% 0.46/0.56 # BW rewrite match attempts : 1
% 0.46/0.56 # BW rewrite match successes : 1
% 0.46/0.56 # Condensation attempts : 0
% 0.46/0.56 # Condensation successes : 0
% 0.46/0.56 # Termbank termtop insertions : 9412
% 0.46/0.56 # Search garbage collected termcells : 4537
% 0.46/0.56
% 0.46/0.56 # -------------------------------------------------
% 0.46/0.56 # User time : 0.007 s
% 0.46/0.56 # System time : 0.009 s
% 0.46/0.56 # Total time : 0.017 s
% 0.46/0.56 # Maximum resident set size: 3372 pages
% 0.46/0.56
% 0.46/0.56 # -------------------------------------------------
% 0.46/0.56 # User time : 0.025 s
% 0.46/0.56 # System time : 0.019 s
% 0.46/0.56 # Total time : 0.044 s
% 0.46/0.56 # Maximum resident set size: 2864 pages
% 0.46/0.57 % E---3.1 exiting
% 0.46/0.57 % E exiting
%------------------------------------------------------------------------------